Node sampling using Random Centrifugal Walks
نویسندگان
چکیده
منابع مشابه
Node Sampling Using Random Centrifugal Walks
Sampling a network with a given probability distribution has been identified as a useful operation. In this paper we propose distributed algorithms for sampling networks, so that nodes are selected by a special node, called the source, with a given probability distribution. All these algorithms are based on a new class of random walks, that we call Random Centrifugal Walks (RCW). A RCW is a ran...
متن کاملBrief Announcement: Node Sampling Using Centrifugal Random Walks
We propose distributed algorithms for sampling networks based on a new class of random walks that we call Centrifugal Random Walks (CRW). A CRW is a random walk that starts at a source and always moves away from it. We propose CRW algorithms for connected networks with arbitrary probability distributions, and for grids and networks with regular concentric connectivity with distance based distri...
متن کاملSampling Combinatorial Spaces Using Biased Random Walks
For probabilistic reasoning, one often needs to sample from a combinatorial space. For example, one may need to sample uniformly from the space of all satisfying assignments. Can state-of-the-art search procedures for SAT be used to sample effectively from the space of all solutions? And, if so, how uniformly do they sample? Our initial results find that on the positive side, one can find all s...
متن کاملLecture 6 : Random Walks versus Independent Sampling
For many problems it is necessary to draw samples from some distribution D on a typically large set V . In order to do so, one often considers a Markov chain on V whose limiting distribution is D. The efficiency of the sampling algorithm requires the Markov chain to converge quickly. Two famous examples where this approach have been applied successfully are approximation algorithms for the perm...
متن کاملOn Clustering Using Random Walks
We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is centered around what we shall call separating operators, which are applied repeatedly to sharpen the distinction between the weights of inter-cluster edges (the so-called separators), and those of intra-cluster edges. These operat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Science
سال: 2015
ISSN: 1877-7503
DOI: 10.1016/j.jocs.2015.09.001